28 resultados para Lot sizing and scheduling

em Cambridge University Engineering Department Publications Database


Relevância:

100.00% 100.00%

Publicador:

Resumo:

In the modern and dynamic construction environment it is important to access information in a fast and efficient manner in order to improve the decision making processes for construction managers. This capability is, in most cases, straightforward with today’s technologies for data types with an inherent structure that resides primarily on established database structures like estimating and scheduling software. However, previous research has demonstrated that a significant percentage of construction data is stored in semi-structured or unstructured data formats (text, images, etc.) and that manually locating and identifying such data is a very hard and time-consuming task. This paper focuses on construction site image data and presents a novel image retrieval model that interfaces with established construction data management structures. This model is designed to retrieve images from related objects in project models or construction databases using location, date, and material information (extracted from the image content with pattern recognition techniques).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper reviews advances in the technology of integrated semiconductor optical amplifier based photonic switch fabrics, with particular emphasis on their suitability for high performance network switches for use within a datacenter. The key requirements for large port count optical switch fabrics are addressed noting the need for switches with substantial port counts. The design options for a 16×16 port photonic switch fabric architecture are discussed and the choice of a Clos-tree design is described. The control strategy, based on arbitration and scheduling, for an integrated switch fabric is explained. The detailed design and fabrication of the switch is followed by experimental characterization, showing net optical gain and operation at 10 Gb/s with bit error rates lower than 10-9. Finally improvements to the switch are suggested, which should result in 100 Gb/s per port operation at energy efficiencies of 3 pJ/bit. © 2011 Optical Society of America.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper bound. However, approximating the optimal value function by an upper bound is computationally expensive and therefore tightness is often sacrificed to improve efficiency (e.g., sawtooth approximation). In this paper, we describe a new approach to efficiently compute tighter bounds by i) conducting a prioritized breadth first search over the reachable beliefs, ii) propagating upper bound improvements with an augmented POMDP and iii) using exact linear programming (instead of the sawtooth approximation) for upper bound interpolation. As a result, we can represent the bounds more compactly and significantly reduce the gap between upper and lower bounds on several benchmark problems. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The control plane is implemented for the first time to allow scheduling and power leveling in a monolithic 8×8 space and wavelength selective cross-connect. 16 dynamic data connections are established within 16μs. © 2013 Optical Society of America.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. The aim is to minimise the variance of the estimation error of the hidden state w.r.t. the action sequence. We present a novel simulation-based method that uses a stochastic gradient algorithm to find optimal actions. © 2007 Elsevier Ltd. All rights reserved.